Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy
نویسندگان
چکیده
This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation termination. We propose several algorithms with various worst-case and average-case time complexities, and evaluate their computation elapse times. 2005 Elsevier B.V. All rights reserved.
منابع مشابه
On achieving fairness in the joint allocation of buffer and bandwidth resources: Principles and algorithms
Fairness in network traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate certain kinds of transient bottlenecks and may serve as a critical component of a strategy to achieve certain guaranteed services such as delay bounds and minimum bandwidths. While fairness in bandwidth allocation over a shared link has been studied extensive...
متن کاملA Generic Weight-Based Network Bandwidth Sharing Policy for ATM ABR
This paper presents a novel generic weight-based network bandwidth sharing policy and an available bit rate (ABR) algorithm that achieves this policy. Our policy supports the minimum cell rate (MCR) requirement and peak cell rate (PCR) constraint of each connection and allocates network bandwidth among all connections based on a weight associated with each connection. To achieve this policy for...
متن کاملA parametric Linear Programming Model Describing Bandwidth Sharing Policies for ABR Traffic
We consider the fair bandwidth allocation problem of ABR calls by a Connection Admission Controller (CAC) at call setup. Its general solution is given by applying the “max-min fairness allocation policy”. Extensions of this policy take into account the Minimum Cell Rate (MCR) and the Peak Cell Rate (PCR) traffic description parameters, which are essential for ABR. These extensions are distingui...
متن کامل2 Q : Worst-case Fair Weighted Fair Queueing
The Generalized Processor Sharing (GPS) discipline is proven to have two desirable properties: (a) it can provide an end-to-end bounded-delay service to a session whose tra c is constrained by a leaky bucket; (b) it can ensure fair allocation of bandwidth among all backlogged sessions regardless of whether or not their tra c is constrained. The former property is the basis for supporting guaran...
متن کاملFair Airport Scheduling Algorithms
We design a class of Fair Airport (FA) algorithms that combines Start-time Fair Queuing with a non-work conserving algorithm in the Rate Controlled Service Discipline (RCSD) class. We derive the fairness and deadline guarantees for FA servers. We demonstrate that by appropriately choosing an algorithm from the RCSD class, algorithms that either allocate only rate or achieve separation of rate a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 97 شماره
صفحات -
تاریخ انتشار 2006